Parameterized VT area function inversion
نویسندگان
چکیده
The purpose of our study is to contribute tools for inversion of articulatory to acoustics relations, in specific to perform an estimate of vocal tract area-function parameters from formant frequencies. The inversion is performed in two steps. A first approximation is attained from either a codebook or a neural net and a final optimization is performed by an iterative interpolation for finding a perfect or acceptable match. The study is based on a three-parameter vocal tract model. The codebook relates each of the possible combinations of constriction location, Xc, constriction area, Ac, and the lip parameter, l0/A0 to a corresponding F1, F2, F3 pattern. The neural network output provides the same choice of possible VT states as the codebook. The input to the neural network is normally programmed in terms of formant frequencies but other acoustic attributes can be selected or added. Present experience is limited to vocalic area functions. Our present system provides a rapid conversion of formant frequency data to VT parameters and has provided promising results for short sentences.
منابع مشابه
A study of acoustic-to-articulatory inversion of speech by analysis-by-synthesis using chain matrices and the Maeda articulatory model.
In this paper, a quantitative study of acoustic-to-articulatory inversion for vowel speech sounds by analysis-by-synthesis using the Maeda articulatory model is performed. For chain matrix calculation of vocal tract (VT) acoustics, the chain matrix derivatives with respect to area function are calculated and used in a quasi-Newton method for optimizing articulatory trajectories. The cost functi...
متن کاملVocal tract inversion by cepstral analysis-by-synthesis using chain matrices
Acoustic-to-articulatory inversion for vowels is performed by cepstral analysis-by-synthesis, using chain-matrix calculation of vocal tract (VT) acoustics and the Maeda articulatory model. The derivative of the VT chain matrix with respect to the area function was calculated in a novel efficient manner, and used in the BFGS quasi-Newton method for optimizing a distance measure between input and...
متن کاملTo appear in Algorithmica A Cubic - Vertex Kernel for Flip Consensus Tree
Given a bipartite graph G = (Vc, Vt, E) and a nonnegative integer k, the NP-complete Minimum-Flip Consensus Tree problem asks whether G can be transformed, using up to k edge insertions and deletions, into a graph that does not contain an induced P5 with its first vertex in Vt (a so-called M-graph or Σgraph). This problem plays an important role in computational phylogenetics, Vc standing for t...
متن کاملNonperturbational surface-wave inversion: A Dix-type relation for surface waves
We extend the approach underlying the well-known Dix equation in reflection seismology to surface waves. Within the context of surface wave inversion, the Dix-type relation we derive for surface waves allows accurate depth profiles of shear-wave velocity to be constructed directly from phase velocity data, in contrast to perturbational methods. The depth profiles can subsequently be used as an ...
متن کاملInversion of Gravity Data by Constrained Nonlinear Optimization based on nonlinear Programming Techniques for Mapping Bedrock Topography
A constrained nonlinear optimization method based on nonlinear programming techniques has been applied to map geometry of bedrock of sedimentary basins by inversion of gravity anomaly data. In the inversion, the applying model is a 2-D model that is composed of a set of juxtaposed prisms whose lower depths have been considered as unknown model parameters. The applied inversion method is a nonli...
متن کامل